spanning tree中文是什么意思

发音:

中文翻译
造句

跨越树(生成树)
扫瞄树
生成树, 支撑树
最大树生成树

span span1 〔古语〕 spin 的过去式。
tree n. 1.树〔主要指乔木，也可指较大的灌木〕。 ★玫瑰可 ...
depth-first spanning tree 深度优先生成树
directed spanning tree 有向生成树
minimal spanning tree 最小生成树
minimal spanning tree algorithm 最小生成树算法
minimum cost spanning tree 最小代价生成树
minimum spanning tree 最小生成树
minimum(cost)spanning tree 最楔代价）生成树
mst minimum spanning tree 最小生成树
spanning tree (mathematics) 最小生成树
spanning tree algorithm 伸缩树法; 伸缩树算法; 生成树算法, 支撑树算法
spanning-tree protocol 生成树协议
spanning-tree protocol manipulation 生成树协议操作
tsts transparent spanning tree schema 透明生成树状轮廓图
spanning 分解; 跨越; 生成的; 斯潘宁; 斯蓬宁
boundary spanning 跨越管理
device spanning 设备跨越; 设备跨展
disk spanning 硬盘数据跨盘
linear spanning 线性生成
spanning airfoil 全跨度翼
spanning cluster 跨越集团
spanning equipment 渡河设备
spanning forest 生成森林
spanning rail 对接导轨

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Virtually the only concept to be used is that of a spanning tree .
更确切地说，只使用了生成树的概念。
Evidently, the graph must be connected in order to contain a spanning tree .
显然一个图必须是连通的才能包含一生成树。
There is a recursive formula for the number of spanning trees in a graph .
对于一个图的生成树的棵数，存在一个递推公式。
In particular, if t is a spanning tree of g, we shall call its complement t' a cotree .
如果T是G的一棵生成树，我们称它的补集T'为一副树。
The relationship between bonds and cotrees is analogous to that between cycles and spanning trees .
键和余树之间的关系类似于圈和生成树之间的关系。
A protection algorithm for mesh virtual ring based on spanning tree
一种光网络中统一网管的实现方案
Algorithm of documents categorization based on bayesian - spanning tree
基于贝叶斯扩张树的文本分类算法
Algorithm and analysis of fuzzy minimal spanning tree in fluid pipeline networks
流体管网中模糊最小树的算法与分析
Asymptotic enumeration theorem for the number of spanning trees in grids and tori
格子图与环纹面的支撑树数的渐近定理
Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法

更多例句： 1 2 3 4 5

百科解释

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G. Informally, a spanning tree of G is a selection of edges of G that form a tree spanning every vertex.

详细百科解释